The MVA priority approximation
نویسندگان
چکیده
منابع مشابه
The AMVA Priority Approximation
Most computer systems contain one or more system resources whose usage is controlled on the basis of workload priorities. Unfortunately, the exact analysis of queueing network models incorporating priority scheduling disciplines is usually infeasible. The MVA Priority Approximation has been proposed as a comparatively inexpensive, and yet reasonably accurate, approximation technique for queuein...
متن کاملThe Approximation Power of Priority Algorithms by Spyros Angelopoulos
The Approximation Power of Priority Algorithms Spyros Angelopoulos Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Greedy-like algorithms have been a popular approach in combinatorial optimization, due to their conceptual simplicity and amenability to analysis. Surprisingly, it was only recently that a formal framework for their study emerged. In particul...
متن کاملThe Tree MVA Algorithm
A new algorithm to solve product form queueing networks, especially those with large numbers of centers and chains, is presented. This algorithm is a Tree version of .Mean Value Analysis (MVA). Tree MVA is analogous to the Tree version of Convolution developed by Lam and Lien Like Tree Convolution, Tree WA allows exact solution of large networks which are intractable with previous sequential al...
متن کاملMVA: The Multimodal Virtual Assistant
The Multimodal Virtual Assistant (MVA) is an application that enables users to plan an outing through an interactive multimodal dialog with a mobile device. MVA demonstrates how a cloud-based multimodal language processing infrastructure can support mobile multimodal interaction. This demonstration will highlight incremental recognition, multimodal speech and gesture input, contextually-aware l...
متن کاملApproximation in Stochastic Scheduling: the Power of Lp-based Priority Rules Approximation in Stochastic Scheduling: the Power of Lp-based Priority Rules
We address the problem of minimizing the total weighted completion time in stochastic machine scheduling. A set of jobs has to be processed on identical parallel machines, job processing times are drawn from some known probability distribution, and the aim is to find a scheduling strategy that minimizes the objective in expectation. The overall driving question is: What is the performance of si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 1984
ISSN: 0734-2071,1557-7333
DOI: 10.1145/357401.357406